Quantum multiparty communication complexity and circuit lower bounds
نویسندگان
چکیده
منابع مشابه
Quantum Multiparty Communication Complexity and Circuit Lower Bounds
We define a quantum model for multiparty communication complexity and prove a simulation theorem between the classical and quantum models. As a result, we show that if the quantum k-party communication complexity of a function f is Ω( n 2k ), then its classical k-party communication is Ω( n 2k/2 ). Finding such an f would allow us to prove strong classical lower bounds for k ≥ log n players and...
متن کاملSimplified Lower Bounds on the Multiparty Communication Complexity of Disjointness
We show that the deterministic number-on-forehead communication complexity of set disjointness for k parties on a universe of size n is Ω(n/4). This gives the first lower bound that is linear in n, nearly matching Grolmusz’s upper bound of O(log(n) + kn/2). We also simplify Sherstov’s proof showing an Ω( √ n/(k2)) lower bound for the randomized communication complexity of set disjointness.
متن کاملMultiparty Quantum Communication Complexity
Quantum entanglement cannot be used to achieve direct communication between remote parties, but it can reduce the communication needed for some problems. Let each of k parties hold some partial input data to some fixed k-variable function f . The communication complexity of f is the minimum number of classical bits required to be broadcasted for every party to know the value of f on their input...
متن کاملLower Bounds for Quantum Communication Complexity
We prove new lower bounds for bounded error quantum communication complexity. Our methods are based on the Fourier transform of the considered functions. First we generalize a method for proving classical communication complexity lower bounds developed by Raz [30] to the quantum case. Applying this method we give an exponential separation between bounded error quantum communication complexity a...
متن کاملLower bounds on communication for multiparty computation
The present report contains a proof of a linear lower bound for a typical three-party secure computation scheme of n independent AND functions. The goal is to prove some linear communication lower bound for a maximally broad definition of «typical». The article [1] contains various communications lower bounds for unconditionally secure multiparty computation. In particular, it contains a linear...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Structures in Computer Science
سال: 2009
ISSN: 0960-1295,1469-8072
DOI: 10.1017/s0960129508007263